# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def countAndSay(self, n: int) -> str:
        if n == 1:
            return '1'

        ans = "1"
        for i in range(1, n):
            curr_char_count = 0
            curr_char = ans[0]
            new_ans = ""

            for ch in ans:
                if ch == curr_char:
                    curr_char_count += 1
                else:
                    new_ans += str(curr_char_count) + curr_char
                    curr_char = ch
                    curr_char_count = 1

            new_ans += str(curr_char_count) + curr_char
            ans = new_ans

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        (1, "1"),
        (4, "1211")
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        expect = case_item[len(case_item) - 1]
        exec_result = solution.countAndSay(input1)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

